Preserving redundancy in data deduplication systems by encryption

ABSTRACT

Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed. A selected data segment, to be written through the data deduplication system, is encrypted such that the selected data segment is not subject to a deduplication operation.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No. 13/453,259, filed on Apr. 23, 2012.

FIELD OF THE INVENTION

The present invention relates in general to computers, and more particularly to a method, system, and computer program product for preserving redundancy and other data security characteristics in computing environments in which data deduplication systems are incorporated.

DESCRIPTION OF THE RELATED ART

Computers and computer systems are found in a variety of settings in today's society. Computing environments and networks may be found at home, at work, at school, in government, and in other settings. Computing environments increasingly store data in one or more storage environments, which in many cases are remote from the local interface presented to a user.

These computing storage environments may use many storage devices such as disk drives, often working in concert, to store, retrieve, and update a large body of data, which may then be provided to a host computer requesting or sending the data. In some cases, a number of data storage subsystems are collectively managed as a single data storage system. These subsystems may be managed by host “sysplex” (system complex) configurations that combine several processing units or clusters of processing units. In this way, multi-tiered/multi-system computing environments, often including a variety of types of storage devices, may be used to organize and process large quantities of data.

SUMMARY OF THE INVENTION

Many multi-tiered/multi-system computing environments implement data deduplication technologies to improve storage performance by reducing the amount of duplicated storage across storage devices. Data deduplication systems are increasingly utilized because they help reduce the total amount of physical storage that is required to store data. This reduction is accomplished by ensuring that duplicate data is not stored multiple times. Instead, for example, if a chunk of data matches with an already stored chunk of data, a pointer to the original data is stored in the virtual storage map instead of allocating new physical storage space for the new chunk of data.

In certain situations, however, the behavior of deduplication may go against the redundancy requirements of a hosted application, for example, or a storage policy, or other requirements. A need exists for a mechanism whereby data having redundancy requirements is safeguarded, yet the benefits of deduplication systems are not diminished, by allowing deduplication to occur for remaining data not having such requirements.

In view of the foregoing, various embodiments for preserving data redundancy in data deduplication systems are disclosed. In one embodiment, by way of example only, a method for such preservation is disclosed. A selected data segment, to be written through the data deduplication system, is encrypted such that the selected data segment is not subject to a deduplication operation.

In addition to the foregoing exemplary embodiment, various additional embodiments are provided and supply related advantages.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readily understood, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments that are illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered to be limiting of its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings, in which:

FIG. 1 is a block diagram illustrating an exemplary computing environment which may implement aspects of the present invention;

FIG. 2 is a block diagram showing a hardware structure of a data storage system, again in which aspects of the present invention may be implemented;

FIG. 3 is a block diagram of an exemplary data segment, in which aspects of the present invention may be implemented;

FIG. 4A is a block diagram of an exemplary process of writing data through an encryption module to obtain encrypted write data;

FIG. 4B is a related block diagram of an exemplary process of writing encrypted write data through a data deduplication engine and cache to physical storage;

FIG. 5 is an exemplary method for ensuring redundancy in data deduplication systems according to the present invention;

FIG. 6 is an exemplary method for processing data in which aspects of the present invention may be implemented; and

FIG. 7 is an additional exemplary method for processing data, again in which aspects of the present invention may be implemented.

DETAILED DESCRIPTION OF THE DRAWINGS

Data deduplication in storage controllers typically works “behind the scene” of an application, and may sometimes operate contrary to the interests of the application when deduplication operations are performed against the needs of the application. This situation may arise if an application writes multiple copies of the same data, and intends to retain multiple physical copies, while the deduplication subsystem (deduplication engine) finds these matching copies and ends up deduplicating the copies while storing the data. This can be detrimental to the application, which expects to find multiple copies at various locations, and is made to believe that it has done so by the storage subsystem, but in reality only a single copy of the data has been written.

Consider the following example. File systems usually prefer to write multiple physical copies of the “Superblock,” or a segment of metadata describing the file system on a block-based storage device, (or other metadata information) on a virtual disk to ensure redundancy. Since the contents of the Superblock are the same, data deduplication would result in retaining a single, physical copy of the Superblock and point multiple virtual addresses to the same physical block. This situation is highly inadvisable, because the loss of a single block on the physical copy of the Superblock may render the file system totally unusable, as there are no redundant copies of the Superblock. Conventionally, there are no existing methodologies that directly address this problem in data deduplication systems.

Various indirect methodologies may be employed to attempt to address this problem. In one example, the storage pool from which the data deduplication subsystem carves out physical storage can be mirrored (i.e., contains 2 or 3 copies of the same data). Hence multiple redundant copies can be created despite deduplication. However, this is inadequate protection for the application because of the following reasons. First, the application may wish to keep, for example, ten (10) copies of the same data. However, if the storage pool is two-way mirrored, it may only retain a maximum of two (2) copies. Second, since data deduplication carves out physical storage pools that span across large amounts of storage and multiple file systems, it is likely that multiple applications and file systems share the same physical storage pool. Hence it is possible that some critical copies of data (like the Superblock) get physically placed on the same disk. Since deduplication would prevent multiple copies of the same data to be written to multiple physical locations, the number of copies of critical data reduces and they can get placed on the same physical disk for multiple file systems. This increases the risk of single failures becoming fatal.

The illustrated embodiments provide multiple mechanisms for addressing the issues discussed previously. One goal of these mechanisms is to ensure that the deduplication subsystem in the storage controller (or wherever it may be located) balances the benefits of reducing the number of copies of data against application requirements for physical allocating multiple copies of critical data. Each of the methodologies described in the following illustrated embodiments may be used in a variety of circumstances and may have attendant benefits specific to those circumstances.

In one such embodiment, a selected data segment (such as a block) may be encrypted by an owning application, thereby “tricking” the data deduplication system into thinking that the selected data is new, unduplicated data and must be allocated to new storage space. For example, for data blocks where an owning application must store multiple physical copies of identical data, the application may encrypt the data with the start Logical Block Address (LBA) of the data block (or, alternatively, some other well-known key for the data block that would not require additional metadata storage space, such as the copy number (e.g., the first copy is encrypted with the key 1, the second with key 2, etc.)). Encryption of identical copies with differing keys will render the copies “different” to the eyes of an examining deduplication engine, thus ensuring that a storage controller or other storage management device incorporating the deduplication engine will not deduplicate the blocks.

The encryption technique mentioned above has an advantage in that a storage controller (or again, any storage management device) need not change anything to implement the desired characteristics. The owning application again “tricks” or “fools” the storage controller by using a simple technique and does so without incurring extra overhead or significant processing or resource allocation (e.g., additional metadata storage overhead, but preserving additional resources as one of ordinary skill in the art will appreciate).

In view of the described embodiment, by allowing the application to dictate whether a write must be encrypted (and thereby deciding which data to forgo deduplication), the application is allowed flexibility to implement storage policy associated with the data it generates. This way, the application is in a better position than the deduplication system to determine whether selected data blocks, even though identical, must still be located in separate physical locations. In addition, the storage controller (or other storage management device) continues to perform its role of data reduction by deduplication, and at the same time allowed enough control to the application to rule out deduplication when required.

By designating selected data chunks as encrypted, very fine-grained control is thereby provided to the application, allowing for flexibility in implementation while still retaining advantages of deduplication functionality and retaining redundancy for key data.

In the following description, reference is made to the accompanying drawings which form a part hereof and which illustrate several embodiments of the present invention. It is understood that other embodiments may be utilized and structural and operational changes may be made without departing from the scope of the present invention.

Turning to FIG. 1, an example computer system 10 is depicted in which aspects of the present invention may be realized. Computer system 10 includes central processing unit (CPU) 12, which is connected to mass storage device(s) 14 and memory device 16. Mass storage devices may include hard disk drive (HDD) devices, which may be configured in a redundant array of independent disks (RAID). The data management operations, in which aspects of the present invention may be implemented as further described, may be executed on device(s) 14, located in system 10 or elsewhere. Memory device 16 may include such memory as electrically erasable programmable read only memory (EEPROM) or a host of related devices.

Memory 16 is shown including an application program 15, and an application program 17, in which a file system 19 is operational as well as an encryption module 21. Application 15 and application 17 may create, delete, or otherwise manage segments of data, such as data chunks or data blocks, which are physically stored in devices such as mass storage device 14. File system 19 provides a means to organize data expected to be retained after the application program 17 terminates by providing procedures to store, retrieve, and update data, as well as manage the available space on the device(s) that contain it. The file system 19 organizes data in an efficient manner, and is tuned to the specific characteristics of the device (such as computer 10 and/or memory 16). In one embodiment, application 17 may be an operating system (OS) 17, and file system 19 retains a tight coupling between the OS 17 and the file system 19. File system 19 may provide mechanisms to control access to the data and metadata, and may contain mechanisms to ensure data reliability such as those necessary to further certain aspects of the present invention, as one of ordinary skill in the art will appreciate. File system 19 may provide a means for multiple application programs 15, 17 to update data in the same file at nearly the same time.

Encryption module 21 may be used in conjunction with the application 15, application 17, the file system 19, or other computing hardware or software components to accomplish purposes of the present invention. In one embodiment, for example, encryption module 21 processes selected data chunks designated to forgo deduplication to encrypt at least a portion of the data chunk with a weak security key (again to avoid incurring significant processing and/or resource allocation overhead). Implementation of the encryption mechanism may vary, as one of ordinary skill in the art will appreciate, and the encryption mechanism itself may vary according to a particular implementation. In one embodiment, a goal of the encryption mechanism is to “change” the character of the data just enough for the deduplication engine to think that the data is “new” data, while requiring the least amount of resource and overhead allocation as possible.

In the illustrated embodiment, memory device 16 and mass storage device 14 are connected to CPU 12 via a signal-bearing medium. In addition, CPU 12 is connected through communication port 18 to a communication network 20, having an attached plurality of additional computer systems 22 and 24. The computer system 10 may include one or more processor devices (e.g., CPU 12) and additional memory devices 16 for each individual component of the computer system 10 to execute and perform each operation described herein to accomplish the purposes of the present invention.

FIG. 2 is an exemplary block diagram 200 showing a hardware structure of a data storage system in a computer system according to the present invention. Host computers 210, 220, 225, are shown, each acting as a central processing unit for performing data processing as part of a data storage system 200. The hosts (physical or virtual devices), 210, 220, and 225 may be one or more new physical devices or logical devices to accomplish the purposes of the present invention in the data storage system 200. In one embodiment, by way of example only, a data storage system 200 may be implemented as IBM® System Storage™ DS8000™. A network connection 260 may be a fibre channel fabric, a fibre channel point to point link, a fibre channel over ethernet fabric or point to point link, a FICON or ESCON I/O interface, any other I/O interface type, a wireless network, a wired network, a LAN, a WAN, heterogeneous, homogeneous, public (i.e. the Internet), private, or any combination thereof. The hosts, 210, 220, and 225 may be local or distributed among one or more locations and may be equipped with any type of fabric (or fabric channel) (not shown in FIG. 2) or network adapter 260 to the storage controller 240, such as Fibre channel, FICON, ESCON, Ethernet, fiber optic, wireless, or coaxial adapters. Data storage system 200 is accordingly equipped with a suitable fabric (not shown in FIG. 2) or network adapter 260 to communicate. Data storage system 200 is depicted in FIG. 2 comprising storage controller 240 and storage 230.

To facilitate a clearer understanding of the methods described herein, storage controller 240 is shown in FIG. 2 as a single processing unit, including a microprocessor 242, system memory 243 and nonvolatile storage (“NVS”) 216, which will be described in more detail below. It is noted that in some embodiments, storage controller 240 is comprised of multiple processing units, each with their own processor complex and system memory, and interconnected by a dedicated network within data storage system 200. Storage 230 may be comprised of one or more storage devices, such as storage arrays, which are connected to storage controller 240 by a storage network.

In some embodiments, the devices included in storage 230 may be connected in a loop architecture. Storage controller 240 manages storage 230 and facilitates the processing of write and read requests intended for storage 230. The system memory 243 of storage controller 240 stores program instructions and data that the processor 242 may access for executing functions associated with managing storage 230. In one embodiment, system memory 243 includes, is associated, or is in communication with the operation software 250, and configured in part for accomplishing functionality of the present invention. As shown in FIG. 2, system memory 243 may also include or be in communication with a cache 245 for storage 230, also referred to herein as a “cache memory”, for buffering “write data” and “read data”, which respectively refer to write/read requests and their associated data. In one embodiment, cache 245 is allocated in a device external to system memory 243, yet remains accessible by microprocessor 242 and may serve to provide additional security against data loss, in addition to carrying out the operations as described in herein.

In some embodiments, cache 245 is implemented with a volatile memory and non-volatile memory and coupled to microprocessor 242 via a local bus (not shown in FIG. 2) for enhanced performance of data storage system 200. The NVS 216 included in data storage controller is accessible by microprocessor 242 and serves to provide additional support for operations and execution of the present invention as described in other figures. The NVS 216, may also referred to as a “persistent” cache, or “cache memory” and is implemented with nonvolatile memory that may or may not utilize external power to retain data stored therein. The NVS may be stored in and with the cache 245 for any purposes suited to accomplish the objectives of the present invention. In some embodiments, a backup power source (not shown in FIG. 2), such as a battery, supplies NVS 216 with sufficient power to retain the data stored therein in case of power loss to data storage system 200. In certain embodiments, the capacity of NVS 216 is less than or equal to the total capacity of cache 245.

Storage 230 may be physically comprised of one or more storage devices, such as storage arrays. A storage array is a logical grouping of individual storage devices, such as a hard disk. In certain embodiments, storage 230 is comprised of a JBOD (Just a Bunch of Disks) array or a RAID (Redundant Array of Independent Disks) array. A collection of physical storage arrays may be further combined to form a rank, which dissociates the physical storage from the logical configuration. The storage space in a rank may be allocated into logical volumes, which define the storage location specified in a write/read request.

In one embodiment, by way of example only, the storage system as shown in FIG. 2 may include a logical volume, or simply “volume,” may have different kinds of allocations. Storage 230 a, 230 b and 230 n are shown as ranks in data storage system 200, and are referred to herein as rank 230 a, 230 b and 230 n. Ranks may be local to data storage system 200, or may be located at a physically remote location. In other words, a local storage controller may connect with a remote storage controller and manage storage at the remote location. Rank 230 a is shown configured with two entire volumes, 234 and 236, as well as one partial volume 232 a. Rank 230 b is shown with another partial volume 232 b. Thus volume 232 is allocated across ranks 230 a and 230 b. Rank 230 n is shown as being fully allocated to volume 238—that is, rank 230 n refers to the entire physical storage for volume 238. From the above examples, it will be appreciated that a rank may be configured to include one or more partial and/or entire volumes. Volumes and ranks may further be divided into so-called “tracks,” which represent a fixed block of storage. A track is therefore associated with a given volume and may be given a given rank.

The storage controller 240 includes a control switch 241 for controlling the fiber channel protocol to the host computers 210, 220, 225, a microprocessor 242 for controlling all the storage controller 240, a nonvolatile control memory 243 for storing a microprogram (operation software) 250 for controlling the operation of storage controller 240, data for control and each table described later, cache 245 for temporarily storing (buffering) data, and buffers 244 for assisting the cache 245 to read and write data, a control switch 241 for controlling a protocol to control data transfer to or from the storage devices 230, and compression operation module 255 and compression operation list module 257 in which information may be set. Multiple buffers 244 may be implemented with the present invention to assist with the operations as described herein.

In one embodiment, the host computers or one or more physical or virtual devices, 210, 220, 225 and the storage controller 240 are connected through a network adaptor (this could be a fibre channel) 260 as an interface i.e., via at least one switch called “fabric.” In one embodiment, the operation of the system shown in FIG. 2 will be described. The microprocessor 242 may control the memory 243 to store command information from the host device (physical or virtual) 210 and information for identifying the host device (physical or virtual) 210. The control switch 241, the buffers 244, the cache 245, the operating software 250, the microprocessor 242, memory 243, NVS 216, compression operation module 255 and compression operation list module 257 are in communication with each other and may be separate or one individual component(s). Also, several, if not all of the components, such as the operation software 250 may be included with the memory 243. Each of the components within the devices shown may be linked together and may be in communication with each other for purposes suited to the present invention.

The storage controller 240 is shown including a data deduplication engine 255, in which a number of write data 259 is processed. The data deduplication engine 255 may be structurally one complete module or may be associated and/or incorporated within other individual modules. Data deduplication engine 255 is configured for performing, in conjunction with other components of storage controller 240 such as microprocessor 242, data deduplication operations on write data 259 passed through storage controller 240 to storage 230.

As previously indicated, storage controller 240 includes cache 245 (or what may be termed holistically as cache system) 245 accepts write data from hosts 210, 220, and 225, or similar devices, that is then placed in cache memory 245. Data deduplication engine 255 then tests the write data for duplication in the cache memory 245. The write data 259 that the application 17 (FIG. 1) desires to protect from deduplication operations are encrypted with encryption keys 257 as shown (encrypted data 257). Those of the write data 259 having encryption keys 257 that are passed through the data deduplication engine 255 designate to the data deduplication engine 255 that they are “new” data, and thereby not subject to a deduplication operation (e.g., replaced with a pointer to existing data already placed in storage 230).

In one embodiment, the application 17/file system 19 first determines whether a given data block must be stored multiple times on physical storage. This may be Superblock metadata associated with the file system 19 itself, or other relevant file system information, for example. The application 17 then encrypts those data blocks with a unique key for that virtual device before a write is issued. As a following step, the application may initiate a write request to the underlying disk (device) driver, along with the encrypted data 257, in effect designating that this data block is “new” and must not be deduplicated, even if the unencrypted block is identical to a previously written data block. Encryption may be performed by the owning application on a per-disk-block basis using the LBA of that block as the weak encryption key.

Here again, the selected encryption method (including encryption key) chosen such that the key is simple to deduce when it is later read back from the underlying storage controller or storage management device. Examples of encryption keys may include the following: (1) the start LBA of the selected data block; (2) the offset of the data block within the file; and other similar encryption mechanisms that one of ordinary skill in the art would be familiar. The encryption key should be weak and predictable (i.e., the owning application will know, without storing the key anywhere, what the encryption key for a specific meta-block would be).

In a following step, the disk driver in turn prepares a write command, such as a Small Computer Systems Interface (SCSI) command to the storage controller 240. On receiving the designated, encrypted data block, the storage controller 240, via data deduplication engine 255, skips the deduplication steps of fingerprint generation, matching, etc., as one of ordinary skill in the art will appreciate, and directly writes the selected data block onto a new physical disk location, even if there may have been earlier instances of identical data being stored on the storage controller 240. Later, on a subsequent read of these data blocks (well known to the application), the application decrypts the data using the well-known and simple key (e.g., weak key/encryption mechanism). Since the encryption techniques used herein are not necessarily for data security, any overhead for performing such techniques may be efficiently minimized as much as possible.

In a preferred embodiment, an encryption or data transformation function should be chosen such that the size of the resultant data remains unaltered. For example, in a situation where 512 bytes of data are to be transformed, 512 bytes of resultant encrypted data are produced.

In one embodiment, the owning application may choose to encrypt multiple blocks of data written as a unit. The data transformation function (encryption function) should be such that decrypting each individual block returns the original data for this block. Alternatively, the application should read these multi-block units as chunks of data and decrypt them as a unit.

Turning now to FIG. 3, a block diagram 300 of an exemplary data segment 259 (i.e., block) is illustrated, in which various aspects of the illustrated embodiments may be incorporated. Data segment 259 includes a weak encryption key 302 (such as the present copy-1, 2, 3, and so on), which is appended to a portion of block A as shown.

FIG. 4A illustrates a block diagram 400 of various functional aspects of the present invention as depicted as an exemplary flow. Specifically, data to be written 402 through the data deduplication engine yet not processed with any deduplication operations are first, before a write command is issued to the storage controller, passed through the encryption module 21 (FIG. 1), where a weak encryption is applied to the selected data and generate encrypted write data 404 as shown.

Continuing with FIG. 4B, block diagram 406 illustrates additional various functional aspects of the present invention, again as depicted as an exemplary flow. Specifically, the encrypted write data 408 is passed to the storage controller to be written to storage 230 (again, FIG. 2). The encrypted write data is passed through the data deduplication engine 255 as shown, where the encrypted data 259 is thought to be new data versus existing, potentially duplicate data. As such, the data deduplication engine passes the encrypted data in conjunction with the write request 410 to other portions of the storage controller, such as the cache system 245, and new space in storage 230 is allocated for the encrypted data, where it is ultimately written.

With the foregoing in view, FIG. 5, following, is an exemplary method 500 for ensuring data redundancy in storage subsystems having data deduplication systems, in which aspects of the illustrated embodiments may be implemented. Method 500 begins (step 502) with the encryption of a selected data segment to be written through the data deduplication system such that the selected data segment is not subject to a deduplication operation (step 504). The method 500 then ends (step 506).

In FIG. 6, following, an exemplary method 600 for data processing is illustrated, here again in which various aspects of the present invention may be implemented. Method 600 begins (step 602), with the selection of a unique encryption key by the owning application to be associated with a data segment chosen by the owning application to forgo deduplication (step 604). The owning application and/or file system then encrypts the selected data segment with the unique encryption key (step 606).

As a following step, a write request, along with the encrypted, selected data segment, is provided to the storage controller (step 608). The encrypted data segment is then processed through the deduplication engine, whereupon a deduplication operation is withheld from being performed on the encrypted data as the selected data segment is recognized/treated by the deduplication engine as “new” data (step 610).

In step 612, the encrypted data segment is written in a newly allocated physical storage location. In a later, subsequent read of the encrypted data, the encrypted data is then returned to the owning application and/or file system (step 614). Then, the encrypted data segment is decrypted by the application and/or file system using the affiliated encryption algorithm (step 616), which again, as one of ordinary skill in the art will appreciate, may vary according to a particular application but may be selected to minimize overhead and bandwidth. The method 600 then ends (step 618).

FIG. 7, following, is a related exemplary method 700 for processing data, here again incorporating various aspects of the present invention. Method 700 begins (step 702) with a write request being received by the storage controller/data deduplication engine for processing along with accompanying data to be written (step 704).

In step 706, the method 700 queries whether the accompanying data is encrypted (step 706). If so, the deduplication engine/storage controller forgoes performing data deduplication operations (step 708), and the encrypted data is written in a newly allocated physical storage location (step 710). Note, for purposes of illustration, the “method” 700 is said to query whether the data is encrypted. In actuality, however, the data deduplication system does not understand, and does not query, whether the data is encrypted or not. As previously explained, by virtue of encryption, the data block will not match with its duplicate copy previously written by the owning application. Hence, the deduplication system will treat this as a “new” data block, and will write the block to physical storage. Returning to step 706, if the accompanying data is not encrypted, then the deduplication engine/storage controller performs various deduplication operations on the data (step 712). The method 700 then ends (step 714).

As will be appreciated by one of ordinary skill in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module,” “process” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical fiber cable, RF, etc., or any suitable combination of the foregoing. Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, or entirely on the remote computer or server. In the last scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks. The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the above figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

While one or more embodiments of the present invention have been illustrated in detail, one of ordinary skill in the art will appreciate that modifications and adaptations to those embodiments may be made without departing from the scope of the present invention as set forth in the following claims. 

What is claimed is:
 1. A method for preserving data redundancy in a data deduplication system in a computing environment by a processor, comprising: encrypting a selected data segment to be written through the data deduplication system such that the selected data segment is not subject to a deduplication operation.
 2. The method of claim 1, further including processing the encrypted, selected data segment through the computing environment such that the deduplication operation is withheld from being performed on the selected data segment.
 3. The method of claim 2, wherein encrypting the selected data segment further includes encrypting the selected data segment with a unique encryption key for an associated virtual device in advance of issuing a write request to an underlying storage controller device.
 4. The method of claim 3, wherein encrypting the selected data segment with the unique key further includes selecting the encryption key to be associated with one of a start of a logical block address (LBA) for the selected data segment, and an offset of the selected data segment within a file, wherein an encryption function is chosen to retain a size of encrypted data processed through the encryption function.
 5. The method of claim 4, wherein encrypting the selected data segment includes choosing multiple selected data segments written as a unit such that one of decrypting each of the multiple selected data segments returns original data for each segment, and each of the multiple selected data segments are decrypted as the unit.
 6. The method of claim 2, wherein processing the encrypted, selected data segment includes issuing a write request for the encrypted, selected data segment through a deduplication engine in a storage controller of the computing environment.
 7. The method of claim 6, wherein during execution of the write request for the encrypted, selected data segment, the data deduplication engine recognizes the encrypted, selected data segment as a new segment of data and withholds performing the deduplication operation.
 8. The method of claim 1, further including, on a subsequent read operation of the selected data segment, decrypting the selected data segment.
 9. The method of claim 8, wherein decrypting the selected data segment includes decrypting the selected data segment with a weak, unique, and predictable encryption key. 